منابع مشابه
A new lower bound for snake-in-the-box codes
In this paper we give a new lower bound on the length of Snake-in-the-Box Codes, i.e., induced cycles in the d-dimensional cube. The bound is a linear function of the number of vertices of the cube and improves the bound c · 2/d, where c is a constant, proved by Danzer and Klee. AMS subject classification 1980: 05 C 35, 94 B 25
متن کاملExponential Lower Bound for 2-Query Locally Decodable Codes
We prove exponential lower bounds on the length of 2-query locally decodable codes. Goldreich et al. recently proved such bounds for the special case of linear locally decodable codes. Our proof shows that a 2-query locally decodable code can be decoded with only 1 quantum query, and then proves an exponential lower bound for such 1-query locally quantum-decodable codes. We also exhibit q-query...
متن کاملA lower bound for constant dimension codes from multi-component lifted MRD codes
In this work we investigate unions of lifted MRD codes of a fixed dimension and minimum distance and derive an explicit formula for the cardinality of such codes. This will then imply a lower bound on the cardinality of constant dimension codes. We will first repeat some known results needed in this section. In Section 2 we will explain the construction and derive the formula for the cardinalit...
متن کاملCombinatorial batch codes: A lower bound and optimal constructions
Batch codes, introduced by Ishai, Kushilevitz, Ostrovsky and Sahai in [1], are methods for solving the following data storage problem: n data items are to be stored in m servers in such a way that any k of the n items can be retrieved by reading at most t items from each server, and that the total number of items stored in m servers is N . A Combinatorial batch code (CBC) is a batch code where ...
متن کاملA Lower Bound on the Weight Hierarchies of Product Codes
The weight of a code is the number of coordinate positions where not all codewords are zero. The rth minimum weight dr is the least weight of an r-dimensional subcode. Wei and Yang conjectured a formula for the minimum weights of some product codes, and this conjecture has recently been proved in two di2erent ways. In this self-contained paper, we give a further generalisation, with a new proof...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1987
ISSN: 0012-365X
DOI: 10.1016/0012-365x(87)90147-6